This paper addresses distributed parameter coordination methods for wireless communication systems. This proposes\r\na method based on a message-passing algorithm, namely min-sum algorithm, on factor graphs for the application of\r\nprecoder selection. Two particular examples of precoder selection are considered: transmit antenna selection and\r\nbeam selection. Evaluations on the potential of such an approach in a wireless communication network are provided,\r\nand its performance and convergence properties are compared with those of a baseline selfish/greedy approach.\r\nSimulation results for the precoder selection examples are presented and discussed, which show that the\r\ngraph-based technique generally obtains gain in sum rate over the greedy approach at the cost of a larger message\r\nsize. Besides, the proposed method usually reaches the global optima in an efficient manner. Methods of improving\r\nthe rate of convergence of the graph-based distributed coordination technique and reducing its associated message\r\nsize are therefore important topics for wireless communication networks.
Loading....